Learning Best Concept Approximations from Examples
نویسندگان
چکیده
This paper addresses the problem of learning the best approximation of a concept from examples, when the concept cannot be expressed in the learner’s representation language. It presents a method that determines the version space of the best approximations and demonstrates that for any given approximation of the target concept there is a better approximation in this version space. The method does not depend on the order of examples and has an almost monotonic convergence. This method was developed for the Disciple learning agent that can be taught by a subject matter expert how to perform complex problem solving tasks.
منابع مشابه
Analysis of Complexity Bounds Random Sets for Pac-learning With
Learnability in Valiant’s pac-learning formalism is reformulated in terms of expected (average) error instead of confidence and error parameters. A finite-domain, random set formalism is introduced to develop algorithm-dependent, distributionspecific analytic error estimates. Two random set theorems for finite concept-spaces are presented to facilitate these developments. Analyses are carried o...
متن کاملResults on Learnability and the Vapnik-Chervonenkis Dimension*
We consider the problem of learning a concept from examples in the distributionfree model by Valiant. (An essentially equivalent model, if one ignores issues of computational difficulty, was studied by Vapnik and Chervonenkis.) We introduce the notion of dynamic sampling, wherein the number of examples examined may increase with the complexity of the target concept. This method is used to estab...
متن کاملResults on learnability and the Vapnik-Chervonenkis dimension (Extended Abstract)
We consider the problem of learning a concept from examples in the distributionfree model by Valiant. (An essentially equivalent model, if one ignores issues of computational difficulty, was studied by Vapnik and Chervonenkis.) We introduce the notion of dynamic sampling, wherein the number of examples examined may increase with the complexity of the target concept. This method is used to estab...
متن کاملThe best uniform polynomial approximation of two classes of rational functions
In this paper we obtain the explicit form of the best uniform polynomial approximations out of Pn of two classes of rational functions using properties of Chebyshev polynomials. In this way we present some new theorems and lemmas. Some examples will be given to support the results.
متن کاملLearning cross-level certain and possible rules by rough sets
Machine learning can extract desired knowledge and ease the development bottleneck in building expert systems. Among the proposed approaches, deriving rules from training examples is the most common. Given a set of examples, a learning program tries to induce rules that describe each class. Recently, the rough-set theory has been widely used in dealing with data classification problems. Most of...
متن کامل